Shuffled languages—Representation and recognition
نویسندگان
چکیده
منابع مشابه
Mapped Shuffled Fibonacci Languages
The purpose of this paper is to study properties of mapped shuffled Fibonacci languages F(afi) and F^vy Let X — {a?6} be an alphabet and let X* be the free monoid generated by X. Let 1 be the empty word and let X+ — X* \ {1}. The length of a word u is denoted by lg(w). Every subset of X* is called a language. For two words u, v E X + ? we consider the following type of Fibonacci sequence of words:
متن کاملHybridizing Shuffled Frog Leaping and Shuffled Complex Evolution Algorithms Using Local Search Methods
In this research, a study was carried out to exploit the hybrid schemes combining two classical local search techniques i.e. Nelder–Mead simplex search method and bidirectional random optimization with two metaheuristic methods i.e. the shuffled frog leaping and the shuffled complex evolution, respectively. In this hybrid methodology, each subset of meta-heuristic algorithms is improved by a hy...
متن کاملRecognizing Shuffled Languages
Language models that use interleaving, or shuffle, operators have applications in various areas of computer science, including system verification, plan recognition, and natural language processing. We study the complexity of the membership problem for such models, i.e., how difficult it is to determine if a string belongs to a language or not. In particular, we investigate how interleaving can...
متن کاملShuffled Graph Classification: Theory and Connectome Applications
We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are called shuffled graphs. Our formalism provides insight to trivially answer a number of open statistical questions including: (i) under what conditions does ...
متن کاملCorrections to "Shuffled Iterative Decoding"
In the above paper [1], the second paragraph of the introduction was accidentally omitted. This paragraph and corresponding citations should appear as follows. As for iterative decoding of LDPC codes, there are two main scheduling approaches, probabilistic approaches and deterministic approaches. Although both scheduling approaches provide better complexity/performance tradeoff than their stand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.04.022